Block graphs with unique minimum dominating sets
نویسندگان
چکیده
منابع مشابه
Block graphs with unique minimum dominating sets
For any graph G a set D of vertices of G is a dominating set, if every vertex v∈V (G)− D has at least one neighbor in D. The domination number (G) is the smallest number of vertices in any dominating set. In this paper, a characterization is given for block graphs having a unique minimum dominating set. With this result, we generalize a theorem of Gunther, Hartnell, Markus and Rall for trees. c...
متن کاملA Review on Graphs with Unique Minimum Dominating Sets
A dominating set for a graph G is a subset D of V such that every vertex not in D is adjacent to at least one member of D. This paper deals with some of the graphs having unique minimum dominating sets. We also find a unique minimum dominating sets for block graphs and maximum graphs.
متن کاملTrees with unique minimum total dominating sets
A set S of vertices of a graph G is a total dominating set if every vertex of V (G) is adjacent to some vertex in S. We provide three equivalent conditions for a tree to have a unique minimum total dominating set and give a constructive characterization of such trees.
متن کاملTrees with unique minimum p - dominating sets ∗
Let p be a positive integer and G = (V,E) a simple graph. A p-dominating set of G is a subset S of V such that every vertex not in S is dominated by at least p vertices in S. The p-domination number γp(G) is the minimum cardinality among the p-dominating sets of G. In this paper, for p ≥ 2, we give three equivalent conditions for trees with unique minimum p-dominating sets and also give a const...
متن کاملOn unique minimum dominating sets in some Cartesian product graphs
Unique minimum vertex dominating sets in the Cartesian product of a graph with a complete graph are considered. We first give properties of such sets when they exist. We then show that when the first factor of the product is a tree, consideration of the tree alone is sufficient to determine if the product has a unique minimum dominating set.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2001
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(01)00196-0